Datacenters provide the infrastructure for cloud computing services used bymillions of users everyday. Many such services are distributed over multipledatacenters at geographically distant locations possibly in differentcontinents. These datacenters are then connected through high speed WAN linksover private or public networks. To perform data backups or datasynchronization operations, many transfers take place over these networks thathave to be completed before a deadline in order to provide necessary serviceguarantees to end users. Upon arrival of a transfer request, we would like thesystem to be able to decide whether such a request can be guaranteed successfuldelivery. If yes, it should provide us with transmission schedule in theshortest time possible. In addition, we would like to avoid packet reorderingat the destination as it affects TCP performance. Previous work in this areaeither cannot guarantee that admitted transfers actually finish before thespecified deadlines or use techniques that can result in packet reordering. Inthis paper, we propose DCRoute, a fast and efficient routing and trafficallocation technique that guarantees transfer completion before deadlines foradmitted requests. It assigns each transfer a single path to avoid packetreordering. Through simulations, we show that DCRoute is at least 200 timesfaster than other traffic allocation techniques based on linear programming(LP) while admitting almost the same amount of traffic to the system.
展开▼
